Functional Dependencies in Relational Expressions Based on Or-Sets
نویسندگان
چکیده
Partial functional dependencies, functional dependencies accompanied by a factor, are examined in a relational database based on or-sets. The partial functional dependencies are dealt with under tuples having their belongingness degree to a relation. Whether a functional dependency accompanied by a factor holds in a relation is determined by comparing the factor with to what degree the relation satisfies the functional dependency. Inference rules, similar to Armstrong’s axioms in the conventional relational databases, are obtained. Thus, we can discover another functional dependencies related with a partial functional dependency by using the inference rules.
منابع مشابه
Mining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملInference Rules for Nested Functional Dependencies
Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path expressions instead of attribute names, resulting in a class of dependencies that we call nested functional...
متن کاملFunctional Dependencies in Relational Databases : A Lattice
A lattice theoretic approach is developed to study the properties of functional dependencies in relational databases. The particular attention is paid to the analysis of the semilattice of closed sets, the lattice of all closure operations on a given set and to a new characterization of normal form relation schemes. Relation schemes with restrictions on functional dependencies are also studied.
متن کاملA Rule-Based Approach to Analyzing Database Schema Objects with Datalog
Database schema elements such as tables, views, triggers and functions are typically defined with many interrelationships. In order to support database users in understanding a given schema, a rule-based approach for analyzing the respective dependencies is proposed using Datalog expressions. We show that many interesting properties of schema elements can be systematically determined this way. ...
متن کاملThe Theory of Functional and Subset Dependencies Over Relational Expressions
A formal system for reasoning about functional dependencies (FDs) and subset dependencies (SDS) defined over relational expressions is described. An FD e: X +Y indicates that Y is functionally dependent on X in the relation denoted by expression e; an SD e c f indicates that the relation denoted by e is a subset of that denoted by f. The system is shown to be sound and complete by resorting to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002